Factoring Elementaryp-Groups
نویسندگان
چکیده
منابع مشابه
Factoring Groups Efficiently
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two subgroups A and B of G such that G is the direct product of A and B, if such a decomposition exists.
متن کاملFactoring finite abelian groups
It is shown that if in the factorization of a finite cyclic group each factor has either prime power order or order equal to the product of two primes then one factor must be periodic. This is shown to be the best possible result of this type. 2004 Elsevier Inc. All rights reserved.
متن کاملFactoring Tilting Modules for Algebraic Groups
Let G be a semisimple, simply-connected algebraic group over an algebraically closed field of characteristic p > 0. We observe that the tensor product of the Steinberg module with a minuscule module is always indecomposable tilting. Although quite easy to prove, this fact does not seem to have been observed before. It has the following consequence: If p > 2h − 2 and a given tilting module has h...
متن کاملFactoring Elementary p-Groups for p ≤ 7
It is an open problem if an elementary p-group of rank k ≥ 3 does admit full-rank normalized factorization into two of its subsets such that one of the factors has p elements. The paper provides an answer in the p ≤ 7 special case.
متن کاملFactoring elementary groups of prime cube order into subsets
Let p be a prime and let G be the 3-fold direct product of the cyclic group of order p. Rédei conjectured if G is the direct product of subsets A and B, each of which contains the identity element of G, then either A or B does not generate all of G. The paper verifies Rédei’s conjecture for p ≤ 11.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1998
ISSN: 0021-8693
DOI: 10.1006/jabr.1997.7416